H s versus C 0-weighted minimizers

Weighted Composition Operators of C 0 ( X ) ’ s ∗ †

In this paper, we prove that into isometries and disjointness preserving linear maps from C0(X) into C0(Y ) are essentially weighted composition operators Tf = h · f ◦ φ for some continuous map φ and some continuous scalar-valued function h.

m at h . FA ] 3 0 Ju l 1 99 6 Weighted Composition Operators of C 0 ( X ) ’ s ∗

In this paper, we prove that into isometries and disjointness preserving linear maps from C0(X) into C0(Y ) are essentially weighted composition operators Tf = h · f ◦ φ for some continuous map φ and some continuous scalar-valued function h.

T H E 2 0 1 0 L a R K C P H D S Y Mp O S I U M No V E Mb E R 1 4 T H , 2 0 1 0

Interleaving reasoning and selection by knowledge summarization is a method todeal with the scalability in large-scale data searches and reasoning. Many exist-ing methods have been developed to improve searches on large-scale data, whichrequire high performance hardware support (with emphasizes on Parallelizationand Cloud architectures). Because the scale of the semantic data gr...

Isolated minimizers , proper efficiency and stability for C 0 , 1 constrained vector optimization problems

In this paper we consider the vector optimization problem minC f(x), g(x) ∈ −K, where f : R → R and g : R → R are C functions and C ⊂ R and K ⊂ R are closed convex cones. We give several notions of solutions (efficiency concepts), among them the notion of a properly efficient point (p-minimizer) of order k and the notion of an isolated minimizer of order k. We show that each isolated minimizer ...

S E a R C H